nekton: A Linearizability Proof Checker

A Generic Proof Checker

The use of formal methods in software development seeks to increase our confidence in the resultant system. Their use often requires tool support, so the integrity of a development using formal methods is dependent on the integrity of the tool-set used. Specifically its integrity depends on the theorem prover, since in a typical formal development system the theorem prover is used to establish ...

SPIN as a Linearizability Checker under Weak Memory Models

Linearizability is the key correctness criterion for concurrent data structures like stacks, queues or sets. Consequently, much effort has been spent on developing techniques for showing linearizability. However, most of these approaches assume a sequentially consistent memory model whereas today’s multicore processors provide relaxed out-of-order execution semantics. In this paper, we present ...

Dedukti: A Universal Proof Checker

Context The success of formal methods both as tools of practical importance and as objects of intellectual curiosity, has spawned a bewildering variety of software systems to support them. While the field has developed to maturity in academia and has registered some important successes in the industry, the full benefit of formal methods in an industrial setting remains largely untapped. We subm...

An Abstract Proof Checker

Mathematicians rarely present proofs in all their detail; usually they give just an outline or abstraction of the proof. This paper describes our attempt to reproduce such activity within a computer proof system.

Code Proof VCGen Proof checker Axioms